Term Sequent Logic
نویسندگان
چکیده
منابع مشابه
Term Sequent Logic
We consider a term sequent logic for the lambda-calculus. Term sequents are a judgement form similar to the logical judgement form of entailment between sentences, but denoting equality or reducibility between terms. Using term sequents, it is possible to treat lambda-terms almost like logical sentences, and to use proof-theoretic methods to establish their properties. We prove a cut-eliminatio...
متن کاملSequent logic of arithmetic decidability∗
Our paper continues, on the one hand, the study of modal logics that have arithmetical semantics, and on the other, the investigation of decidability (or “non-contingency”) logics. We present Hilbert-style axiomatic system for the non-contingency logic of the Gödel-Löb provability logic GL, in other words, for the logic that is complete under the interpretation of a formula BA as ‘a sentence A ...
متن کاملSequent Calculus for Intuitionistic Logic
We present a system of sequent calculus for intuitionistic propositional logic. In later chapters we obtain stronger systems by adding rules to this basic system, and we therefore go through its proof-theoretical properties in detail, in particular the admissibility of structural rules and the basic consequences of cut elimination. Many of these properties can then be verified in a routine fash...
متن کاملA Sequent Calculus for Intuitionistic Default Logic
Current research on non-monotonic reasoning shows growing interest on implementation details, so the need for concrete calculi formalizing non-monotonic logics is clearly recognized. On the other hand, there is also an increased number of works combining intuitionistic logic with various kinds of non-monotonic formalisms. As a case in point, intuitionistic versions of both default and autoepist...
متن کاملOn Sequent Calculi for Intuitionistic Propositional Logic
The well-known Dyckoff’s 1992 calculus/procedure for intuitionistic propositional logic is considered and analyzed. It is shown that the calculus is Kripke complete and the procedure in fact works in polynomial space. Then a multi-conclusion intuitionistic calculus is introduced, obtained by adding one new rule to known calculi. A simple proof of Kripke completeness and polynomial-space decidab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.07.017